Constraint Models for Complex State Transitions
نویسنده
چکیده
Constraint-based scheduling is an approach for solving real-life scheduling problems by combining the generality of AI techniques with the efficiency of OR techniques. Basically, it describes a scheduling problem as a constraint satisfaction problem and then uses constraint satisfaction techniques to find a solution. In this paper we study three constraint models describing complex state transitions that are going beyond the existing models of resources (machines) used in scheduling. These models can naturally handle any setup/changeover/transition scheme as well as special counter constraints imposed on the sequence of activities. The proposed models have been implemented and tested in the commercial scheduling engine of Visopt ShopFloor system.
منابع مشابه
Innovation in the Agro-Food Sector: from Technical Innovation-Centred Approaches to Sustainability Transition Processes
Innovation is a complex phenomenon and process involving translation of knowledge into new techniques, products, services. It is considered crucial for sustainable agriculture development and achievement of long-term food security. The review describes the diversity of innovation and relates it to agro-food sector. It also sheds light on different innovation models and explores their contributi...
متن کاملModelling Resource Transitions
Constraint-based scheduling is an approach for solving scheduling problems using constraint satisfaction techniques. Its main advantage over the traditional scheduling techniques is possibility to model real-life restrictions via specialised constraints. In the paper we propose a concept of the transition constraint that is used to model a state change in resources. We describe and compare thre...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملNew Developments in Closed-Form Computation for GSPN Aggregation
Petri nets are useful for modelling complex concurrent systems. While modelling using Petri nets focusses on local states and actions, the analysis methods are concerned with global states and their transitions. Unfortunately generation of the complete state space suffers from the well-known state space explosion problem. This paper presents a method to overcome the state-space explosion proble...
متن کاملRelative stability of network states in Boolean network models of gene regulation in development
Progress in cell type reprogramming has revived the interest in Waddington's concept of the epigenetic landscape. Recently researchers developed the quasi-potential theory to represent the Waddington's landscape. The Quasi-potential U(x), derived from interactions in the gene regulatory network (GRN) of a cell, quantifies the relative stability of network states, which determine the effort requ...
متن کامل